The Weight of the Greedy Graph Spanner
نویسنده
چکیده
We calculate a near-optimal upper bound on the weight of a graph spanner produced by the (so called) Greedy Spanner Algorithm on a weighted graph. Our upper bound is independent of the magnitude of the weights in the graph, and it matches the known lower bound up to a O(log(n)) for n-vertex graphs. We also update the bound on the size of the spanner, and bound above the weight of any non-MST edge in the graph, which allows for a modiication of the Greedy Algorithm.
منابع مشابه
\delta -Greedy t-spanner
We introduce a new geometric spanner, δ-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy spanner combines the most desirable properties of geometric spanners both in theory and in practice. More specifically, it has the same theoretical and practical properties as the Path-Greedy spanner: a natural definition, small degree, l...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملConstruction of Minimum-Weight Spanners
Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching and message distribution in networks. These applications use some variant of the socalled greedy algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Gre...
متن کاملLight Spanners
A t-spanner of a weighted undirected graph G = (V,E), is a subgraph H such that dH(u, v) ≤ t · dG(u, v) for all u, v ∈ V . The sparseness of the spanner can be measured by its size (the number of edges) and weight (the sum of all edge weights), both being important measures of the spanner’s quality – in this work we focus on the latter. Specifically, it is shown that for any parameters k ≥ 1 an...
متن کاملFinding Light Spanners in Bounded Pathwidth Graphs
Given an edge-weighted graph G and > 0, a (1+ )-spanner is a spanning subgraph G′ whose shortest path distances approximate those of G within a factor of 1+ . For G from certain graph families (such as bounded genus graphs and apex graphs), we know that light spanners exist. That is, we can compute a (1+ )-spanner G′ with total edge weight at most a constant times the weight of a minimum spanni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995